#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;

class Solution {
public:
	int findDuplicate(vector<int>& nums) {
		sort(nums.begin(), nums.end());
		for (int i = 0; i < nums.size()-1; i++) {
			if (nums[i] == nums[i + 1]) {
				return nums[i];
			}
		}
		return -1;
	}
};

int main() {
	vector<int> arr = { 3,2,5,14,5,5,19,18,11,10,1,4,5,5,5,5,12,5,17,5 };
	Solution s;
	//s.findDuplicate(arr);
	int count = 0;
	for (int i = 0; i < 10; i++) {
		count += 10 > i;
	}
	cout << count;
}